Three-colourable perfect graphs without even pairs
نویسندگان
چکیده
We still do not know how to construct the “most general” perfect graph, not even the most general three-colourable perfect graph. But constructing all perfect graphs with no even pairs seems easier, and here we make a start on it; we construct all three-connected three-colourable perfect graphs without even pairs and without clique cutsets. They are all either line graphs of bipartite graphs, or complements of such graphs.
منابع مشابه
k-L(2, 1)-Labelling for Planar Graphs is NP-Complete
A mapping from the vertex set of a graph G = (V,E) into an interval of integers {0, . . . , k} is an L(2, 1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbour are mapped onto distinct integers. It is known that for any fixed k ≥ 4, deciding the existence of such a labelling is an NP-complete p...
متن کاملCharacterising claw-free t-perfect graphs
We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملOn claw-free t-perfect graphs
A graph is called t-perfect, if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملParameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs
For fixed integers r, l ≥ 0, a graph G is called an (r, l)-graph if the vertex set V (G) can be partitioned into r independent sets and l cliques. Such a graph is also said to have cochromatic number r + l. The class of (r, l) graphs generalizes r-colourable graphs (when l = 0) and hence not surprisingly, determining whether a given graph is an (r, l)-graph is NP-hard even when r ≥ 3 or l ≥ 3 i...
متن کاملParameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs
For fixed integers r, ` ≥ 0, a graph G is called an (r, `)-graph if the vertex set V (G) can be partitioned into r independent sets and ` cliques. Such a graph is also said to have cochromatic number r + `. The class of (r, `) graphs generalizes r-colourable graphs (when ` = 0) and hence not surprisingly, determining whether a given graph is an (r, `)-graph is NP-hard even when r ≥ 3 or ` ≥ 3 i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 102 شماره
صفحات -
تاریخ انتشار 2012